CLOOSTING: CLustering Data with bOOSTING
نویسندگان
چکیده
We present a novel clustering approach, that exploits boosting as the primary means of modelling clusters. Typically, boosting is applied in a supervised classification context; here, we move in the less explored unsupervised scenario. Starting from an initial partition, clusters are iteratively re-estimated using the responses of one-vs-all boosted classifiers. Within-cluster homogeneity and separation between the clusters are obtained by a combination of three mechanisms: use of regularised Adaboost to reject outliers, use of weak learners inspired to subtractive clustering and smoothing of the decision functions with a Gaussian Kernel. Experiments on public datasets validate our proposal, in some cases improving on the state of the art.
منابع مشابه
A Hybrid Framework for Building an Efficient Incremental Intrusion Detection System
In this paper, a boosting-based incremental hybrid intrusion detection system is introduced. This system combines incremental misuse detection and incremental anomaly detection. We use boosting ensemble of weak classifiers to implement misuse intrusion detection system. It can identify new classes types of intrusions that do not exist in the training dataset for incremental misuse detection. As...
متن کاملBoosting for Model-Based Data Clustering
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn the base clustering models. The experimental results on relatively large scale datasets and also Caltech4 object recognition set demonstrate how the performance of relatively simple and computationally efficient base c...
متن کاملA hierarchical clusterer ensemble method based on boosting theory
Bagging and boosting are two successful well-known methods for developing classifier ensembles. It is recognized that the clusterer ensemble methods which utilize the boosting concept, can create clusterings with quality and robustness improvement. In this paper, we introduce a new boosting based hierarchical clusterer ensemble method called Bob-Hic. This method is utilized to create a consensu...
متن کاملClustering in a Boosting Framework
In this paper we present a novel approach for creating partitions of data space using simple clustering algorithms in a boosting framework. A general boosting algorithm for clustering tasks is proposed, and solutions for directly optimizing two loss functions according to this framework are obtained. Experimental results show how the performance of relatively simple and computationally efficien...
متن کاملClustering Using Boosted Constrained k-Means Algorithm
This article proposes a constrained clustering algorithmwith competitive performance and less computation time to the state-of-the-art methods, which consists of a constrained k-means algorithm enhanced by the boosting principle. Constrained k-means clustering using constraints as background knowledge, although easy to implement and quick, has insufficient performance compared with metric learn...
متن کامل